#include <iostream>
#include "Object.h"
#include "Exception.h"
#include "List.h"
#include "SeqList.h"
#include "StaticSeqList.h"
#include "DynamicSeqList.h"
#include "Array.h"
#include "StaticArray.h"
#include "DynamicArray.h"
#include "LinkList.h"
#include "StaticLinkList.h"
#include "CircleLinkList.h"
#include "DualLinkList.h"
#include "StaticDualLinkList.h"
#include "CircleDualLinkList.h"
#include "Stack.h"
#include "StaticStack.h"
#include "LinkStack.h"
#include "Queue.h"
#include "StaticQueue.h"
#include "LinkQueue.h"
#include "TreeNode.h"
#include "Tree.h"
#include "GTreeNode.h"
#include "GTree.h"
#include "BTreeNode.h"
#include "BTree.h"
#include "Graph.h"
#include "MyString.h"

using namespace std;
using namespace MySTL;

int main()
{
	/*BTreeNode<int> stn;
	BTree<int> t;
	BTreeNode<int>* tn = NULL;
	stn.value = 1;

	t.insert(&stn);

	tn = t.find(1);
	t.insert(2, tn);
	t.insert(3, tn);

	tn = t.find(2);
	t.insert(6, tn);

	tn = t.find(3);
	t.insert(4, tn);
	t.insert(5, tn);

	for (t.begin(); !t.end(); t.next())
	{
		cout << t.current()->value << endl;
	}*/

	String s1 = "hello";

	system("pause");

	return 0;
}